On the Thom-Boardman Symbols for Polynomial Multiplication Maps

نویسندگان

  • Jiayuan Lin
  • Janice Wethington
چکیده

The Thom-Boardman symbol was first introduced by Thom in 1956 to classify singularities of differentiable maps. It was later generalized by Boardman to a more general setting. Although the Thom-Boardman symbol is realized by a sequence of non-increasing, nonnegative integers, to compute those numbers is, in general, extremely difficult. In the case of polynomial multiplication maps, Robert Varley conjectured that computing the Thom-Boardman symbol for polynomial multiplication reduces to computing the successive quotients and remainders for the Euclidean algorithm applied to the degrees of the two polynomials. In this paper, we confirm this conjecture.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Homotopy Principle for Maps with Prescribed Thom-boardman Singularities

Let N and P be smooth manifolds of dimensions n and p (n ≥ p ≥ 2) respectively. Let Ω (N, P ) denote an open subspace of J∞(N, P ) which consists of all Boardman submanifolds Σ (N, P ) of symbols J with J ≤ I. An Ω -regular map f : N → P refers to a smooth map having only singularities in Ω (N, P ) and satisfying transversality condition. We will prove what is called the homotopy principle for ...

متن کامل

Cobordisms of Maps without Prescribed Singularities

Let N and P be smooth closed manifolds of dimensions n and p respectively. Given a Thom-Boardman symbol I, a smooth map f : N → P is called an Ω -regular map if and only if the Thom-Boardman symbol of each singular point of f is not greater than I in the lexicographic order. We will represent the group of all cobordism classes of Ω -regular maps of n-dimensional closed manifolds into P in terms...

متن کامل

On Computing Short Products

A polynomial consisting of only the low degree monomials of the (full) product of two univariate polynomials f and g is called a short product of f and g. A global algorithm, independent of the actual multiplication algorithm used, to compute short products is proposed. Its performance for several multiplication algorithms is studied. Also several applications of short products are pointed out.

متن کامل

9 M ay 2 00 7 Thom polynomials and Schur functions : the singularities I 2 , 2 ( − )

The global behavior of singularities is governed by their Thom polynomials (cf. [35], [14], [1], [11], [31]). Knowing the Thom polynomial of a singularity η, denoted T η, one can compute the cohomology class represented by the η-points of a map. We do not attempt here to survey all activities related to computations of Thom polynomials, which are difficult tasks in general. In the present paper...

متن کامل

Thom polynomials and Schur functions I

We give the Thom polynomials for the singularities I2,2, and A3 associated with maps (C•, 0) → (C, 0) with parameter k ≥ 0. We give the Schur function expansions of these Thom polynomials. Moreover, for the singularities Ai (with any parameter k ≥ 0) we analyze the “first approximation” F (i) to the Thom polynomial. Our computations combine the characterization of Thom polynomials via the “meth...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009